Approximating the bottleneck plane perfect matching of a point set
نویسندگان
چکیده
منابع مشابه
Approximating the bottleneck plane perfect matching of a point set
A bottleneck plane perfect matching of a set of n points in R is defined to be a perfect non-crossing matching that minimizes the length of the longest edge; the length of this longest edge is known as bottleneck. The problem of computing a bottleneck plane perfect matching has been proved to be NP-hard. We present an algorithm that computes a bottleneck plane matching of size at least n5 in O(...
متن کاملPacking Plane Perfect Matchings into a Point Set
Let P be a set of n points in general position in the plane (no three points on a line). A geometric graph G = (P,E) is a graph whose vertex set is P and whose edge set E is a set of straight-line segments with endpoints in P . We say that two edges of G cross each other if they have a point in common that is interior to both edges. Two edges are disjoint if they have no point in common. A subg...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملNoisy Bottleneck Colored Point Set Matching in 3D
In this paper we tackle the problem of matching two colored point sets in R under the bottleneck distance. First we present an exact matching algorithm that requires the computation of intersections of complex algebraic surfaces. To avoid this, we also present an approximate algorithm that is implementable and has improved asymptotic cost at the price of having the risk of ”missing” some soluti...
متن کاملBottleneck Non-crossing Matching in the Plane
Let P be a set of 2n points in the plane, and letMC (resp.,MNC) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of P . We study the problem of computing MNC. We first prove that the problem is NP-hard and does not admit a PTAS. Then, we present an O(n log n)-time algorithm that computes a noncrossing matching M of P , such that bn(M) ≤ 2 √ 10 · bn(MNC), where bn(M) is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2015
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2015.06.005